Technical Note—A Branch-and-Bound Algorithm for Seeking theP-Median
نویسندگان
چکیده
منابع مشابه
A tight bound drop exchange algorithm for solving thep median problem
A drop algorithm is proposed for solving the p median problem. In solving for a fixed value of p, tight bounds on all other median solutions in the range m-\ to p4-1 are generated where m is the number of possible location sites and p is the number of medians. A step by step numerical example is described, and extensive computational experience is reported for some standard sets of tests proble...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملAn Asynchronous Branch-and-Bound DCOP Algorithm
Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coordinate their values such that the sum of the resulting constraint costs is minimal. It is often desirable to solve DCOP problems with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB...
متن کاملA Branch-and-Bound Algorithm for MDL Learning Bayesian Networks
This paper extends the work in [Suzuki, 1996] and presents an efficient depth-first branch and-bound algorithm for learning Bayesian network structures, based on the minimum description length (MDL) principle, for a given (consistent) variable ordering. The algorithm exhaustively searches through all network structures and guarantees to find the network with the best MDL score. Prelimi nary e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1972
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.20.1.173